On Covering Problems and the Central Facilities Location Problem
نویسندگان
چکیده
منابع مشابه
Hub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملON RELATIVE CENTRAL EXTENSIONS AND COVERING PAIRS
Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...
متن کاملSolving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in a trade area where competing facilities already exist. The objective is to maximize the market share captured by the franchise as a whole. We perform extensive computational tests and conclude that a two-step heuristic...
متن کاملThe Ordered Gradual Covering Location Problem on a Network
In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance. Ordered Median Location problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2010
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.1974.tb00513.x